InforLorV4, Main, Exploration, bibRecord, 000F75

Computing prime implicant

Identifieur interne : 000F75 ( Main/Exploration ); précédent : 000F74; suivant : 000F76

Computing prime implicant

Auteurs : David Déharbe [Brésil] ; Pascal Fontaine [France] ; Daniel Le Berre [France] ; Bertrand Mazure [France]

Source :

RBID : Hal:hal-00910363

Abstract

Model checking and counter-example guided abstraction refinement are examples of applications of SAT solving requiring the production of models for satisfiable formulas. Better than giving a truth value to every variable, one can provide an implicant, i.e. a partial assignment of the variables such that every full extension is a model for the formula. An implicant is prime if every assignment is necessary. Since prime implicants contain no literal irrelevant for the satisfiability of the formula, they are considered as highly refined information. We here propose a novel algorithm that uses data structures found in modern CDCL SAT solvers to efficiently compute prime implicants starting from an existing model. The original aspects are (1) the algorithm is based on watched literals and a form of propagation of required literals, adapted to CDCL solvers (2) the algorithm works not only on clauses, but also on generalized constraints (3) for clauses and, more generally for cardinality constraints, the algorithm complexity is linear in the size of the constraints found. We implemented and evaluated the algorithm with the Sat4j library.

Url:

https://hal.inria.fr/hal-00910363

Affiliations:

Links toward previous steps (curation, corpus...)

to stream Hal, to step Corpus: 006A85
to stream Hal, to step Curation: 006A85
to stream Hal, to step Checkpoint: 000E77
to stream Main, to step Merge: 000F86
to stream Main, to step Curation: 000F75

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="it">Computing prime implicant</title>
<author><name sortKey="Deharbe, David" sort="Deharbe, David" uniqKey="Deharbe D" first="David" last="Déharbe">David Déharbe</name>
<affiliation wicri:level="1"><hal:affiliation type="institution" xml:id="struct-110670" status="VALID"><orgName>Universidade Federal do Rio Grande do Norte [Natal]</orgName>
<orgName type="acronym">UFRN</orgName>
<desc><address><addrLine>Caixa Postal 1524 - Campus Universitário Lagoa Nova, CEP 59078-970 | Natal/RN</addrLine>
<country key="BR"></country>
</address>
<ref type="url">https://www.sistemas.ufrn.br/portal/PT/</ref>
</desc>
</hal:affiliation>
<country>Brésil</country>
</affiliation>
</author>
<author><name sortKey="Fontaine, Pascal" sort="Fontaine, Pascal" uniqKey="Fontaine P" first="Pascal" last="Fontaine">Pascal Fontaine</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-107895" status="VALID"><idno type="RNSR">201020692C</idno>
<orgName>Modeling and Verification of Distributed Algorithms and Systems</orgName>
<orgName type="acronym">VERIDIS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/veridis</ref>
</desc>
<listRelation><relation active="#struct-129671" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-423084" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno>
<orgName>INRIA Nancy - Grand Est</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/nancy</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-423084" type="direct"><org type="department" xml:id="struct-423084" status="VALID"><orgName>Department of Formal Methods </orgName>
<orgName type="acronym">LORIA - FM</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/formal-methods</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<settlement type="city">Metz</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université de Lorraine</orgName>
</affiliation>
</author>
<author><name sortKey="Le Berre, Daniel" sort="Le Berre, Daniel" uniqKey="Le Berre D" first="Daniel" last="Le Berre">Daniel Le Berre</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-1628" status="OLD"><orgName>Centre de Recherche en Informatique de Lens</orgName>
<orgName type="acronym">CRIL</orgName>
<desc><address><addrLine>Rue Jean Souvraz - SP 18 62307 LENS CEDEX</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.cril.univ-artois.fr</ref>
</desc>
<listRelation><relation active="#struct-56711" type="direct"></relation>
<relation name="FRE2499" active="#struct-441569" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-56711" type="direct"><org type="institution" xml:id="struct-56711" status="VALID"><orgName>Université d'Artois</orgName>
<orgName type="acronym">UA</orgName>
<desc><address><addrLine>9 rue du Temple - BP 10665 - 62030 Arras cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-artois.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="FRE2499" active="#struct-441569" type="direct"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Mazure, Bertrand" sort="Mazure, Bertrand" uniqKey="Mazure B" first="Bertrand" last="Mazure">Bertrand Mazure</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-90448" status="VALID"><orgName>Centre de Recherche en Informatique de Lens</orgName>
<orgName type="acronym">CRIL</orgName>
<desc><address><addrLine>Rue Jean Souvraz - SP 18 62307 LENS CEDEX</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.cril.univ-artois.fr</ref>
</desc>
<listRelation><relation active="#struct-56711" type="direct"></relation>
<relation name="UMR8188" active="#struct-441569" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-56711" type="direct"><org type="institution" xml:id="struct-56711" status="VALID"><orgName>Université d'Artois</orgName>
<orgName type="acronym">UA</orgName>
<desc><address><addrLine>9 rue du Temple - BP 10665 - 62030 Arras cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-artois.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR8188" active="#struct-441569" type="direct"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-00910363</idno>
<idno type="halId">hal-00910363</idno>
<idno type="halUri">https://hal.inria.fr/hal-00910363</idno>
<idno type="url">https://hal.inria.fr/hal-00910363</idno>
<date when="2013-10-20">2013-10-20</date>
<idno type="wicri:Area/Hal/Corpus">006A85</idno>
<idno type="wicri:Area/Hal/Curation">006A85</idno>
<idno type="wicri:Area/Hal/Checkpoint">000E77</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">000E77</idno>
<idno type="wicri:Area/Main/Merge">000F86</idno>
<idno type="wicri:Area/Main/Curation">000F75</idno>
<idno type="wicri:Area/Main/Exploration">000F75</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="it">Computing prime implicant</title>
<author><name sortKey="Deharbe, David" sort="Deharbe, David" uniqKey="Deharbe D" first="David" last="Déharbe">David Déharbe</name>
<affiliation wicri:level="1"><hal:affiliation type="institution" xml:id="struct-110670" status="VALID"><orgName>Universidade Federal do Rio Grande do Norte [Natal]</orgName>
<orgName type="acronym">UFRN</orgName>
<desc><address><addrLine>Caixa Postal 1524 - Campus Universitário Lagoa Nova, CEP 59078-970 | Natal/RN</addrLine>
<country key="BR"></country>
</address>
<ref type="url">https://www.sistemas.ufrn.br/portal/PT/</ref>
</desc>
</hal:affiliation>
<country>Brésil</country>
</affiliation>
</author>
<author><name sortKey="Fontaine, Pascal" sort="Fontaine, Pascal" uniqKey="Fontaine P" first="Pascal" last="Fontaine">Pascal Fontaine</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-107895" status="VALID"><idno type="RNSR">201020692C</idno>
<orgName>Modeling and Verification of Distributed Algorithms and Systems</orgName>
<orgName type="acronym">VERIDIS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/veridis</ref>
</desc>
<listRelation><relation active="#struct-129671" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-423084" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno>
<orgName>INRIA Nancy - Grand Est</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/nancy</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-423084" type="direct"><org type="department" xml:id="struct-423084" status="VALID"><orgName>Department of Formal Methods </orgName>
<orgName type="acronym">LORIA - FM</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/formal-methods</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<settlement type="city">Metz</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université de Lorraine</orgName>
</affiliation>
</author>
<author><name sortKey="Le Berre, Daniel" sort="Le Berre, Daniel" uniqKey="Le Berre D" first="Daniel" last="Le Berre">Daniel Le Berre</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-1628" status="OLD"><orgName>Centre de Recherche en Informatique de Lens</orgName>
<orgName type="acronym">CRIL</orgName>
<desc><address><addrLine>Rue Jean Souvraz - SP 18 62307 LENS CEDEX</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.cril.univ-artois.fr</ref>
</desc>
<listRelation><relation active="#struct-56711" type="direct"></relation>
<relation name="FRE2499" active="#struct-441569" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-56711" type="direct"><org type="institution" xml:id="struct-56711" status="VALID"><orgName>Université d'Artois</orgName>
<orgName type="acronym">UA</orgName>
<desc><address><addrLine>9 rue du Temple - BP 10665 - 62030 Arras cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-artois.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="FRE2499" active="#struct-441569" type="direct"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Mazure, Bertrand" sort="Mazure, Bertrand" uniqKey="Mazure B" first="Bertrand" last="Mazure">Bertrand Mazure</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-90448" status="VALID"><orgName>Centre de Recherche en Informatique de Lens</orgName>
<orgName type="acronym">CRIL</orgName>
<desc><address><addrLine>Rue Jean Souvraz - SP 18 62307 LENS CEDEX</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.cril.univ-artois.fr</ref>
</desc>
<listRelation><relation active="#struct-56711" type="direct"></relation>
<relation name="UMR8188" active="#struct-441569" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-56711" type="direct"><org type="institution" xml:id="struct-56711" status="VALID"><orgName>Université d'Artois</orgName>
<orgName type="acronym">UA</orgName>
<desc><address><addrLine>9 rue du Temple - BP 10665 - 62030 Arras cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-artois.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR8188" active="#struct-441569" type="direct"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Model checking and counter-example guided abstraction refinement are examples of applications of SAT solving requiring the production of models for satisfiable formulas. Better than giving a truth value to every variable, one can provide an implicant, i.e. a partial assignment of the variables such that every full extension is a model for the formula. An implicant is prime if every assignment is necessary. Since prime implicants contain no literal irrelevant for the satisfiability of the formula, they are considered as highly refined information. We here propose a novel algorithm that uses data structures found in modern CDCL SAT solvers to efficiently compute prime implicants starting from an existing model. The original aspects are (1) the algorithm is based on watched literals and a form of propagation of required literals, adapted to CDCL solvers (2) the algorithm works not only on clauses, but also on generalized constraints (3) for clauses and, more generally for cardinality constraints, the algorithm complexity is linear in the size of the constraints found. We implemented and evaluated the algorithm with the Sat4j library.</div>
</front>
</TEI>
<affiliations><list><country><li>Brésil</li>
<li>France</li>
</country>
<region><li>Grand Est</li>
<li>Lorraine (région)</li>
</region>
<settlement><li>Metz</li>
<li>Nancy</li>
</settlement>
<orgName><li>Université de Lorraine</li>
</orgName>
</list>
<tree><country name="Brésil"><noRegion><name sortKey="Deharbe, David" sort="Deharbe, David" uniqKey="Deharbe D" first="David" last="Déharbe">David Déharbe</name>
</noRegion>
</country>
<country name="France"><region name="Grand Est"><name sortKey="Fontaine, Pascal" sort="Fontaine, Pascal" uniqKey="Fontaine P" first="Pascal" last="Fontaine">Pascal Fontaine</name>
</region>
<name sortKey="Le Berre, Daniel" sort="Le Berre, Daniel" uniqKey="Le Berre D" first="Daniel" last="Le Berre">Daniel Le Berre</name>
<name sortKey="Mazure, Bertrand" sort="Mazure, Bertrand" uniqKey="Mazure B" first="Bertrand" last="Mazure">Bertrand Mazure</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000F75 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000F75 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     Hal:hal-00910363
   |texte=   Computing prime implicant
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Computing prime implicant

Computing prime implicant

Source :

Abstract

Links toward previous steps (curation, corpus...)

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri